Unifying Cluster-Tree Decompositions for Reasoning in Graphical models∗
نویسندگان
چکیده
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Within this framework, we introduce a new algorithm, called bucket-tree elimination (BTE), that extends Bucket Elimination (BE) to trees, and show that it can provide a speed-up of n over BE for various reasoning tasks. Time-space tradeoffs of tree-decomposition processing are analyzed.
منابع مشابه
Unifying tree decompositions for reasoning in graphical models
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the cliquetree algorithm for probabilistic reasoning. Within this framework, we introduce a new algorithm, called bucket-tree elimination (BTE), that extends Bucket Elimination (BE) to trees, and show that it can p...
متن کاملUnifying Cluster-Tree Decompositions for Automated Reasoning
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as jointree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. By following the framework introduced by Shenoy [16], we then introduce a new algorithm, called buckettree elimination (BTE), that extends Bucket Elimination (B...
متن کاملApproximate Inference in Graphical Models using Tensor Decompositions
We demonstrate that tensor decompositions can be used to transform graphical models into structurally simpler graphical models that approximate the same joint probability distribution. In this way, standard inference algorithms such as the junction tree algorithm, can be used in order to use the transformed graphical model for approximate inference. The usefulness of the technique is demonstrat...
متن کاملUnifying Tree-Decomposition Schemes
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas, such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Subsequently, the paper extends the variable-elimination scheme called bucket-elimination (BE) into a two-phase message passing along a bucket-tree (BTE), mak...
متن کاملBounding Search Space Size via (Hyper)tree Decompositions
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to exploit determinism in the problem specification and produce tighter bounds. We demonstrate on a variety of practical problem instances that we are often able to ...
متن کامل